A Comment on “Buffer Space Allocation in Automated Assembly Lines”
نویسندگان
چکیده
منابع مشابه
A New Algorithm for Buffer Allocation in Production Lines
In the paper a new efficient algorithm for the allocation of storage capacity in serial production lines is derived. The proposed method aims to find out the distribution of storage capacity between machines that minimizes the total buffer space assigned to the line satisfying a target production requirement. The algorithm relies on an iterative scheme that, starting from the minimal capacity r...
متن کاملAdaptive policy of buffer allocation and preventive maintenance actions in unreliable production lines
The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...
متن کاملEfficient algorithms for buffer space allocation
This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the prima...
متن کاملHBBA: hybrid algorithm for buffer allocation in tandem production lines
In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion dep...
متن کاملOptimal Buffer Allocation in Production Lines Using an Automata Search
In this paper, we use a learning automata search technique (LAST), which is based on game theory, to solve the optimal buffer allocation problem in production lines. We have incorporated the search algorithm within a simulator in order to optimize the performance of a production line. We have conducted experiments with this algorithm on some problems for which optimal solutions are available in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1991
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.39.5.857